Parameterized norm form equations with arithmetic progressions
نویسندگان
چکیده
Buchmann and Pethő [5] observed that following algebraic integer 10 + 9α + 8α + 7α + 6α + 5α + 4α, with α = 3 is a unit. Since the coefficients form an arithmetic progressions they have found a solution to the Diophantine equation (1) NK/Q(x0 + αx1 + · · ·+ x6α) = ±1, such that (x0, . . . , x6) ∈ Z is an arithmetic progression. Recently Bérczes and Pethő [3] considered the Diophantine equation (2) NK/Q(x0 + αx1 + · · ·+ xn−1αn−1) = m, where α is an algebraic number of degree n, K = Q(α), m ∈ Z and (x0, x1, . . . , xn−1) ∈ Z is nearly an arithmetic progression. The sequence (x0, . . . , xn−1) is said to be nearly an arithmetic progression if there exists d ∈ Z and 0 < δ ∈ R such that |(xi − xi−1)− d| ≤ (max{|x0|, . . . , |xn−1|})1−δ, (i = 1, . . . , n− 1). They proved that equation (2) has only finitely many solutions provided β := nα n αn−1 − α α−1 is an algebraic number of degree at least 3. Moreover they showed that the solution found by Buchmann and Pethő is the only solution to (1). Bérczes and Pethő also considered arithmetic progressions arising from the norm equation (2), where α is a root of X − a, with n ≥ 3 and 2 ≤ a ≤ 100 (see [2]). Let fa ∈ Z[X] be the Thomas polynomial fa := X − (a− 1)X − (a + 2)X − 1. The aim of this paper is to prove the following theorem: Theorem 1. Let α be a root of the polynomial fa, with a ∈ Z. Then the only solutions to the norm form inequality (3) ∣NK/Q(x0 + x1α + x2α) ∣∣ ≤ |2a + 1| such that x0 < x1 < x2 is an arithmetic progression and (x1, x2, x3) is primitive are either (x1, x2, x3) = (−2,−1, 0), (−1, 0, 1) and (0, 1, 2), or they are sporadic solutions that are listed in table 1.
منابع مشابه
Solvability of Diophantine Equations
Attila Bérczes (University of Debrecen): On arithmetic properties of solutions of norm form equations. Abstract. Let α be an algebraic number of degree n and K := Q(α). Consider the norm form equation NK/Q(x0 + x1α+ x2α + . . .+ xn−1α) = b in x0, . . . , xn−1 ∈ Z. (1) Let H denote the solution set of (1). Arranging the elements of H in an |H| × n array H, one may ask at least two natural questi...
متن کاملArithmetic Progressions and Pellian Equations
We consider arithmetic progressions on Pellian equations x2 − d y2 = m, i.e. integral solutions such that the y-coordinates are in arithmetic progression. We construct explicit infinite families of d,m for which there exists a five-term arithmetic progression in the y-coordinate, and we prove the existence of infinitely many pairs d,m parametrized by the points of an elliptic curve of positive ...
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملOn Simultaneous Arithmetic Progressions on Elliptic Curves
and we consider two equations related by such a change of variables to represent the same curve (equivalently, we will deal with elliptic curves up to so-called Weierstrass changes of variables). Consider P0, . . . , Pn ∈ E(K), with Pi = (xi, yi) such that x0, . . . , xn is an arithmetic progression. We say that P0, . . . , Pn are in x-arithmetic progression (x-a.p.) and also say that E has an ...
متن کاملArithmetic progressions on Huff curves
We look at arithmetic progressions on elliptic curves known as Huff curves. By an arithmetic progression on an elliptic curve, we mean that either the x or y-coordinates of a sequence of rational points on the curve form an arithmetic progression. Previous work has found arithmetic progressions on Weierstrass curves, quartic curves, Edwards curves, and genus 2 curves. We find an infinite number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 41 شماره
صفحات -
تاریخ انتشار 2006